Abstract Interpretation with Higher-Dimensional Ellipsoids and Conic Extrapolation

نویسندگان

  • Mendes Oulamara
  • Arnaud Venet
چکیده

Interpretation with Higher-Dimensional Ellipsoids and Conic Extrapolation ∗ Mendes Oulamara† École Normale Supérieure 45 rue d’Ulm 75005 Paris, France [email protected] Arnaud J. Venet Carnegie Mellon University NASA Ames Research Center Moffett Field, CA 94035 [email protected] CAV 2015, 18-24 July 2015 Abstract The inference and the verification of numerical relationships among variables of a program is one of the main goals of static analysis. In this paper, we propose an Abstract Interpretation framework based on higherdimensional ellipsoids to automatically discover symbolic quadratic invariants within loops, using loop counters as implicit parameters. In order to obtain non-trivial invariants, the diameter of the set of values taken by the numerical variables of the program has to evolve (sub-)linearly during loop iterations. These invariants are called ellipsoidal cones and can be seen as an extension of constructs used in the static analysis of digital filters. Semidefinite programming is used to both compute the numerical results of the domain operations and provide proofs (witnesses) of their correctness. keywords: static analysis, semidefinite programming, ellipsoids, conic extrapolationThe inference and the verification of numerical relationships among variables of a program is one of the main goals of static analysis. In this paper, we propose an Abstract Interpretation framework based on higherdimensional ellipsoids to automatically discover symbolic quadratic invariants within loops, using loop counters as implicit parameters. In order to obtain non-trivial invariants, the diameter of the set of values taken by the numerical variables of the program has to evolve (sub-)linearly during loop iterations. These invariants are called ellipsoidal cones and can be seen as an extension of constructs used in the static analysis of digital filters. Semidefinite programming is used to both compute the numerical results of the domain operations and provide proofs (witnesses) of their correctness. keywords: static analysis, semidefinite programming, ellipsoids, conic extrapolation

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems

Abstract. We consider a conic-quadratic (and in particular a quadratically constrained) optimization problem with uncertain data, known only to reside in some uncertainty set U . The robust counterpart of such a problem leads usually to an NP-hard semidefinite problem; this is the case, for example, when U is given as the intersection of ellipsoids or as an n-dimensional box. For these cases we...

متن کامل

Application of Conic Optimization and Semidefinite Programming in Classification

In this paper, Conic optimization and semidefinite programming (SDP) are utilized and applied in classification problem. Two new classification algorithms are proposed and completely described. The new algorithms are; the Voting Classifier (VC) and the N-ellipsoidal Classifier (NEC). Both are built on solving a Semidefinite Quadratic Linear (SQL) optimization problem of dimension n where n is t...

متن کامل

Target flux estimation by calculating intersections between neighboring conic reflector patches.

We propose a fast algorithm to estimate the flux collected by conic reflector patches, based on the calculation of intersections between neighboring patches. The algorithm can be employed in conjunction with the supporting ellipsoids algorithm for freeform reflector design and is shown to be orders of magnitude faster and more scalable than the commonly used Monte Carlo ray tracing approach.

متن کامل

Weakly Relational Numerical Abstract Domains

Interpretation Abstract Interpretation: General theory of sound approximations of semantics [Cousot78]. Numerical Abstract Domain: • computer-representable set D of abstract values, together with: • a concretisation: γ: D → P(V → I), • a partial order: ⊑, ⊥, ⊤, • sound, effective abstract transfer functions {| I |}: ({| I |} ◦ γ)(X ) ⊆ (γ ◦ {| I |})(X ), a sound, effective abstract union ∪: γ(X...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015